Vandermonde Matrices, NP-Completeness, and Transversal Subspaces
نویسندگان
چکیده
Let K be an infinite field. We give polynomial time constructions of families of r-dimensional subspaces of Kn with the following transversality property: any linear subspace of Kn of dimension n− r is transversal to at least one element of the family. We also give a new NP-completeness proof for the following problem: given two integers n and m with n m and a n ×m matrix A with entries in Z, decide whether there exists a n× n sub-determinant of A which is equal to zero.
منابع مشابه
Kernelization for Cycle Transversal Problems
We present new kernelization results for the s-cycle transversal problem for s > 3. In particular, we show a 6k kernel for 4-cycle transversal and a O(k) kernel for s-cycle transversal when s > 4. We prove the NP-completeness of s-cycle transversal on planar graphs and obtain a 74k kernel for 4-cycle transversal on planar graphs. We also give several kernelization results for a related problem ...
متن کاملStrong NP-Completeness of a Matrix Similarity Problem
Consider the following problem: given an upper triangular matrix A, with rational entries and distinct diagonal elements, and a tolerance 1, decide whether there exists a nonsingu-lar matrix G, with condition number bounded by , such that G ?1 AG is 22 block diagonal. This problem, which we shall refer to as DICHOTOMY, is an important one in the theory of invariant subspaces. It has recently be...
متن کاملA Fast Algorithm for the Inversion of Quasiseparable Vandermonde-like Matrices
The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast Gaussian elimination algorithm for the polynomial Vandermonde-like matrices. Later we use the said algorithm to derive fast inversion algorithms for quasise...
متن کاملSpi Connuent Vandermonde Matrices Using Sylvester's Structures Connuent Vandermonde Matrices Using Sylvester's Structures
In this paper we rst show that a con uent Vandermonde matrix may be viewed as composed of some rows of a certain block Vandermonde matrix As a result we derive a Sylvester s structure for this class of matrices that ap pears as a natural generalization of the straightforward one known for usual Vandermonde matrices Then we present some applications as an illustration of the established structur...
متن کاملRandom Vandermonde Matrices-Part I: Fundamental results
In this first part, analytical methods for finding moments of random Vandermonde matrices are developed. Vandermonde Matrices play an important role in signal processing and communication applications such as direction of arrival estimation, precoding or sparse sampling theory for example. Within this framework, we extend classical freeness results on random matrices with i.i.d entries and show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Foundations of Computational Mathematics
دوره 3 شماره
صفحات -
تاریخ انتشار 2003